Almost power sum systems
نویسندگان
چکیده
منابع مشابه
Almost power-Hermitian rings
In this paper we define a new type of rings ”almost powerhermitian rings” (a generalization of almost hermitian rings) and establish several sufficient conditions over a ring R such that, every regular matrix admits a diagonal power-reduction.
متن کاملalmost power-hermitian rings
in this paper we define a new type of rings ”almost powerhermitian rings” (a generalization of almost hermitian rings) and establish several sufficient conditions over a ring r such that, every regular matrix admits a diagonal power-reduction.
متن کاملOn Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ
For a graph H with at most n vertices and a weighing of the edges of Kn with integers, we seek a copy of H in Kn whose weight is minimal, possibly even zero. Of a particular interest are the cases where H is a spanning subgraph (or an almost spanning subgraph) and the case where H is a fixed graph. In particular, we show that relatively balanced weighings of Kn with {−r, . . . , r} guarantee al...
متن کاملLK-INTERIOR SYSTEMS AS SYSTEMS OF “ALMOST OPEN” L-SETS
We study interior operators and interior structures in a fuzzy setting.We investigate systems of “almost open” fuzzy sets and the relationshipsto fuzzy interior operators and fuzzy interior systems.
متن کاملAlmost Odd Random Sum-Free Sets
In this paper we shall extend the results of Cameron [5] and Calkin [1] on the structure of a random sum-free set. A set S of positive integers is sum-free if there do not exist x, y, z ∈ S with x+ y = z. We shall call a sum-free set ultimately complete if there exists n0 so that for all n > n0, n ∈ S ∪ (S + S), that is, every sufficiently large integer not in S is a sum of elements in S. We de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2015
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/2994